A Comparison Between LDPC Block and Convolutional Codes
نویسندگان
چکیده
LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellisbased decoding are irrelevant for message-passing decoders. In this paper, we undertake a comparison of LDPC block and convolutional codes based on several factors: encoding complexity, decoding computational complexity, decoding hardware complexity, decoding memory requirements, decoding delay, and VLSI implementation requirements.
منابع مشابه
Analysis of thresholds for braided block codes in BEC
Low-density parity-check (LDPC) codes, invented by Gallager [2], who described and analyzed a block variant of the codes, arouse great interest of researchers. These codes are widely used in practice since they can be decoded by using relatively simple iterative decoding algorithms. Several modifications of these codes are known, in particular, generalized LDPC codes [3]. In contrast to Gallage...
متن کاملA Comparison of Decoding Latency for Block and Convolutional Codes⋆
In this paper we compare the decoding latency, i.e., the delay between the time a channel symbol is received and the time it is decoded, of block and convolutional codes. In particular, we compare low density parity check (LDPC) block codes with iterative message-passing decoding to convolutional codes with Viterbi decoding and stack sequential decoding. On the basis of simulations, we show tha...
متن کاملA New Construction for Low Density Parity Check Convolutional Codes
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are hence well suited for continuous transmission. In [...
متن کاملPerformance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)
In this paper, we compare the finite-length performance of protograph-based spatially coupled lowdensity parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one w...
متن کاملDecoding LDPC Convolutional Codes on Markov Channels
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...
متن کامل